Data Information Security Algorithm Based on Chaos and Hash Function

Abstract Chaotic systems are characterized by unidirectional, diffusive and initial value sensitivity of hash. Academia can use it to optimize algorithms for mathematical computer encryption keys. This paper focuses on a hash function mixed chaotic system with key. Then the state mapping relationship modified, conclusions obtained. optimal design messy technology key is introduced briefly. A dynamic model improved parameters proposed prevent chaos from affecting speed security algorithm. The results show that this method effectively resist attack forging peer Moreover, computation required algorithm almost negligible.